Zero-Knowledge Proxy Re-Identification Revisited
نویسندگان
چکیده
Zero-knowledge proxy re-identification (ZK-PRI) has been introduced by Blaze et al. in 1998 together with two other well known primitives of recryptography, namely proxy re-encryption (PRE) and proxy re-signature (PRS). A ZK-PRI allows a proxy to transform an identification protocol for Alice into an identification protocol for Bob using a re-proof key. PRE and PRS have been largely studied in the last decade, but surprisingly, no results about ZK-PRI have been published since the pioneer paper of Blaze et al.. We first show the insecurity of this scheme: just by observing the communications Alice can deduce Bob’s secret key. Then we give (i) definitions of the different families of ZK-PRI (bidirectional/unidirectional and interactive/non-interactive) (ii) a formal security model for these primitives and (iii) a concrete construction for each family. Moreover, we show that ZK-PRI can be used to manage the acces policy to several services that require a public key authentication.
منابع مشابه
Public Cloud Data Auditing with Practical Key Update and Zero Knowledge Privacy
Data integrity is extremely important for cloud based storage services, where cloud users no longer have physical possession of their outsourced files. A number of data auditing mechanisms have been proposed to solve this problem. However, how to update a cloud user's private auditing key (as well as the authenticators those keys are associated with) without the user's re-possession of the data...
متن کاملResearch on Zero-Knowledge Proof Protocol
Zero-knowledge proof protocol is a critical component of cryptography, which in recent years has raised increasing concern of many scholars.Its application field is very extensive,and it has made breakthrough progress in many aspects,including mathematics and network safety and so on. This article launches the elaboration from the concept, nature, mathematics theory, general proof process of th...
متن کاملDivertible Protocols and Atomic Proxy Cryptography
First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a definition of protocol divertibility that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta’s definition in the case of interactive zero-knowledge proofs. Other important examples falling under the new ...
متن کاملar X iv : 0 80 2 . 11 13 v 1 [ cs . C R ] 8 F eb 2 00 8 Multi - Use Unidirectional Proxy Re - Signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive named proxy re-signatures where a proxy turns a signature computed under Alice’s secret key into one from Bob on the same message. The semi-trusted proxy does not learn either party’s signing key and cannot sign arbitrary messages on behalf of Alice or Bob. At CCS 2005, Ateniese and Hohenberger revisited the primitive by p...
متن کاملAnonymous Mobile Conference Calls
This paper describes an architecture and protocol for making anonymous mobile conference calls. A number of examples exist where multiple users may wish to communicate in an anonymous manner, such as anonymous virtual support groups (e.g Alcoholics Anonymous). Anonymous group identification schemes coupled with the novel idea of Virtual Numbers, allows for identification to a conference call fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2017 شماره
صفحات -
تاریخ انتشار 2017